Representation of Videokeratoscopic Height Data Using a Set of Discrete Tchebichef Orthogonal Polynomials
نویسندگان
چکیده
The continuous orthogonal polynomials, such as Zernike and pseudo-Zernike, are often used as an expansion of corneal height data. However, the use of continuous polynomials has some limitations due to the discretization. It is because that the integrals are usually approximated by discrete summations, and this process not only leads to numerical errors, but also severely affects some analytical properties such as rotation invariance, orthogonality, etc. To overcome these drawbacks, this paper presents a methodology for decomposing corneal height data into discrete orthogonal Tchebichef polynomials. Tchebichef polynomials, which are a product of angular functions and radial Tchebichef polynomials, are orthogonal in the discrete coordinate. Therefore, the approximation error caused by discretization can be avoided, and the analytical property can be well preserved. Examples of modeling corneal elevation are provided for simulation corneas, real normal corneas, and real abnormal corneas. The experimental results show that the proposed discrete Tchebichef polynomials have better surface representation capability than Zernike polynomials or pseudo-Zernike polynomials, and have more robust fitting for the level of noise found in current videokeratoscopes, so that they can be used as an alternative to fit the corneal surface.
منابع مشابه
Image Analysis by Tchebichef Moments
This paper introduces a new set of orthogonal moment functions based on the discrete Tchebichef polynomials. The Tchebichef moments can be effectively used as pattern features in the analysis of two-dimensional images. The implementation of moments proposed in this paper does not involve any numerical approximation, since the basis set is orthogonal in the discrete domain of the image coordinat...
متن کاملImage representation using separable two-dimensional continuous and discrete orthogonal moments
This paper addresses bivariate orthogonal polynomials, which are a tensor product of two different orthogonal polynomials in one variable. These bivariate orthogonal polynomials are used to define several new types of continuous and discrete orthogonal moments. Some elementary properties of the proposed continuous Chebyshev–Gegenbauer moments (CGM), Gegenbauer–Legendre moments (GLM), and Chebys...
متن کاملImage analysis by discrete orthogonal dual Hahn moments
In this paper, we introduce a set of discrete orthogonal functions known as dual Hahn polynomials. The Tchebichef and Krawtchouk polynomials are special cases of dual Hahn polynomials. The dual Hahn polynomials are scaled to ensure the numerical stability, thus creating a set of weighted orthonormal dual Hahn polynomials. They are allowed to define a new type of discrete orthogonal moments. The...
متن کاملImage Compression Using Discrete Tchebichef Transform Algorithm
─ The Discrete Tchebichef Transform (DTT) based on orthogonal Tchebichef polynomials can be an alternative to Discrete Cosine Transform (DCT) for JPEG image compression standard. The properties of DTT are not only very similar to DCT; it has also higher energy compactness and lower computational advantage using a set of recurrence relation. Through extensive simulation, image reconstruction acc...
متن کاملImage Compression Using a Fast and Efficient Discrete Tchebichef Transform Algorithm
The Discrete Tchebichef Transform (DTT) which based on discrete orthogonal Tchebichef polynomials can be an alternative to the Discrete Cosine Transform (DCT) for image processing such as image compression and image recognition as the properties of the DTT are similar to that of the DCT. The DTT not only has higher energy compactness than the DCT in images that have high illumination value vari...
متن کامل